Solve the Fibonacci sequence using recursionΒΆ

Solve the Fibonacci sequence using recursion.
def fibonacci(N):
  if N == 1 or N == 2:
    return 1
  else:
    return (fibonacci(N - 1) + (fibonacci(N - 2)))

print(fibonacci(7))   # 13

See also

https://www.w3resource.com/python-exercises/data-structures-and-algorithms/python-recursion-exercise-5.php